By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 10, Issue 1, pp. 1-313

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering

Ya. D. Sergeyev, P. Daponte, D. Grimaldi, and A. Molinaro

pp. 1-21

Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources

Guoliang Xue, Theodore P. Lillys, and David E. Dougherty

pp. 22-42

Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition

C. T. Kelley

pp. 43-55

Reduced Storage, Quasi-Newton Trust Region Approaches to Function Optimization

Linda Kaufman

pp. 56-69

A Polynomial Time Algorithm for Shaped Partition Problems

Frank K. Hwang, Shmuel Onn, and Uriel G. Rothblum

pp. 70-81

Stability and Well-Posedness in Linear Semi-Infinite Programming

M. J. Cánovas, M. A. López, J. Parra, and M. I. Todorov

pp. 82-98

Rates of Convergence for a Class of Global Stochastic Optimization Algorithms

G. Yin

pp. 99-120

Multicoordination Methods for Solving Convex Block-Angular Programs

R. R. Meyer and G. Zakeri

pp. 121-131

Efficient Implementation of the Truncated-Newton Algorithm for Large-Scale Chemistry Applications

Dexuan Xie and Tamar Schlick

pp. 132-154

Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm

Robert M. Freund and Jorge R. Vera

pp. 155-176

A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property

Y. H. Dai and Y. Yuan

pp. 177-182

Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path

Clovis C. Gonzaga

pp. 183-194

On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming

Jun Ji, Florian A. Potra, and Rongqin Sheng

pp. 195-210

Penalty and Barrier Methods: A Unified Framework

A. Auslender

pp. 211-230

Cut Size Statistics of Graph Bisection Heuristics

G. R. Schreiber and O. C. Martin

pp. 231-251

Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property

Frank Deutsch, Wu Li, and Joseph D. Ward

pp. 252-268

Fortified-Descent Simplicial Search Method: A General Approach

Paul Tseng

pp. 269-288

Decreasing Functions with Applications to Penalization

A. M. Rubinov, B. M. Glover, and X. Q. Yang

pp. 289-313